Flat Fragments of CTL and CTL*: Separating the Expressive and Distinguishing Powers
نویسنده
چکیده
منابع مشابه
Separating the Expressive and Distinguishing Powers
We study both the expressive and the distinguishing powers of flat temporal logics. These are fragments obtained by restricting the first argument of the Until operator to propositions. Both the linear and the braching-time cases are considered.
متن کاملEffect of LIGHT Adjuvant on Kinetics of T-Cell Responses Induced by HSV-1 DNA Immunization
Background: Studies on efficacy of various vaccines that prevent or reduce the primary and recurrent HSV-1 infection have demonstrated the importance of cellular immunity for protection against the infection. We previously used DNA vaccination to induce cellular immunity against HSV-1 infection in mice. Objective: The aim of our study was to evaluate the effect of LIGHT, a member of TNF super f...
متن کاملCTL Responses to DCs Stimulated with Leishmania Antigens Detected by DCs Expressing Leishmania gp63
Background: Leishmania is a pathogenic parasite which infects mononuclear cells in vertebrate hosts. Different strategies have been taken to develop immunity against Leishmania . DCs loaded with immunogenic antigen have resulted in different levels of Th1-type immune response and cytotoxic T lymphocytes (CTL) activity. Objective: To evaluate the potency of DCs primed with soluble Leishmania mex...
متن کاملKinetics of Primary and Memory Cytotoxic T Lymphocyte Responses to Herpes Simplex Virus 1 Infection: Granzyme B Mediated CTL Activity
Background: Herpes simplex virus type 1 is one of the most common viruses among human population. Studies demonstrate the essential role of cell mediated immunity, especially CD8+ T cells, in prevention and clearance of HSV1. Objective: It is of great importance to improve our knowledge about the kinetics of CTL responses to primary and secondary HSV-1 infection. Methods: Using a sensitive tech...
متن کاملOn Expressive and Model Checking Power of Propositional Program Logics (extended Abstract of a Short Talk) Ctl and C vs. Second-order Logics
We examine when a model checker for a propositional program logic can be used for checking another propositional program logic in spite of lack of expressive power of the rst logic. We prove that (1) a branching time Computation Tree Logic CTL, (2) the propositional-Calculus of D. Kozen C , and (3) the second-order propositional program logic 2M of C. Stirling enjoy the equal model checking pow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Logic Journal of the IGPL
دوره 7 شماره
صفحات -
تاریخ انتشار 1999